Fixed-density De Bruijn Sequences
نویسندگان
چکیده
De Bruijn sequences are circular strings of length 2 whose substrings are the binary strings of length n. Our focus is on de Bruijn sequences for binary strings that have the same density (number of 1s). We construct circular strings of length ( n−1 d )
منابع مشابه
De Bruijn Sequences for Fixed-Weight Binary Strings
De Bruijn sequences are circular strings of length 2n whose length n substrings are the binary strings of length n. Our focus is on creating circular strings of length (
متن کاملOn cross joining de Bruijn sequences
We explain the origins of Boolean feedback functions of nonlinear feedback shift registers (NLFSRs) of fixed order n generating de Bruijn binary sequences. They all come into existence by cross joining operations starting from one maximum period feedback shift register, e.g., a linear one which always exists for any order n. The result obtained yields some constructions of NLFSRs generating max...
متن کاملDe Bruijn Sequences for the Binary Strings with Maximum Specified Density
A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n
متن کاملCryptographically Strong de Bruijn Sequences with Large Periods
In this paper we first refine Mykkeltveit et al.’s technique for producing de Bruijn sequences through compositions. We then conduct an analysis on an approximation of the feedback functions that generate de Bruijn sequences. The cycle structures of the approximated feedback functions and the linear complexity of a sequence produced by an approximated feedback function are determined. Furthermo...
متن کاملOn the Parikh-de-Bruijn grid
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural insight into the nature of sets of Parikh vectors as well as that of the Parikh set of a given string. We show its utility by proving some results on Parikh-de-Bruijn strings, the abelian analog of de-Bruijn sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011